Pancyclic in-tournaments

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

t-Pancyclic Arcs in Tournaments

Let $T$ be a non-trivial tournament. An arc is emph{$t$-pancyclic} in $T$, if it is contained in a cycle of length $ell$ for every $tleq ell leq |V(T)|$. Let $p^t(T)$ denote the number of $t$-pancyclic arcs in $T$ and $h^t(T)$ the maximum number of $t$-pancyclic arcs contained in the same Hamiltonian cycle of $T$. Moon ({em J. Combin. Inform. System Sci.}, {bf 19} (1994), 207-214) showed that $...

متن کامل

The out-arc 5-pancyclic vertices in strong tournaments

An arc in a tournament T with n ≥ 3 vertices is called k-pancyclic, if it belongs to a cycle of length l for all k ≤ l ≤ n. In this paper, the result that each s-strong (s ≥ 3) tournament T contains at least s + 2 out-arc 5-pancyclic vertices is obtained. Furthermore, our proof yields a polynomial algorithm to find s + 2 out-arc 5-pancyclic vertices of T .

متن کامل

Pancyclic out-arcs of a Vertex in Tournaments

Thomassen (J. Combin. Theory Ser. B 28, 1980, 142–163) proved that every strong tournament contains a vertex x such that each arc going out from x is contained in a Hamiltonian cycle. In this paper, we extend the result of Thomassen and prove that a strong tournament contains a vertex x such that every arc going out from x is pancyclic, and our proof yields a polynomial algorithm to nd such a v...

متن کامل

Diregular c-partite tournaments are vertex-pancyclic when c ≥ 5

In 4] it is conjectured that all diregular c-partite tournaments, with c 4, are pan-cyclic. In this paper we show that all diregular c-partite tournaments, with c 5, are in fact vertex-pancyclic.

متن کامل

The structure of strong tournaments containing exactly one out-arc pancyclic vertex

An arc in a tournament T with n ≥ 3 vertices is called pancyclic if it belongs to a cycle of length l for all 3 ≤ l ≤ n. We call a vertex u of T an out-arc pancyclic vertex of T if each out-arc of u is pancyclic in T . Yao, Guo and Zhang [Discrete Appl. Math. 99 (2000), 245–249] proved that every strong tournament contains at least one out-arc pancyclic vertex, and they gave an infinite class o...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Mathematics

سال: 2001

ISSN: 0012-365X

DOI: 10.1016/s0012-365x(00)00238-7